A novel hybrid meta-heuristic algorithm for optimization problems
نویسندگان
چکیده
منابع مشابه
A novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems
In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...
متن کاملA NOVEL META-HEURISTIC ALGORITHM: TUG OF WAR OPTIMIZATION
This paper presents a novel population-based meta-heuristic algorithm inspired by the game of tug of war. Utilizing a sport metaphor the algorithm, denoted as Tug of War Optimization (TWO), considers each candidate solution as a team participating in a series of rope pulling competitions. The teams exert pulling forces on each other...
متن کاملA Meta-heuristic Algorithm for Global Numerical Optimization Problems inspired by Vortex in fluid physics
One of the most important issues in engineering is to find the optimal global points of the functions used. It is not easy to find such a point in some functions due to the reasons such as large number of dimensions or inability to derive them from the function. Also in engineering modeling, we do not have the relationships of many functions, but we can input and output them as a black box. The...
متن کاملA Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm
The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems Science & Control Engineering
سال: 2018
ISSN: 2164-2583
DOI: 10.1080/21642583.2018.1531359